A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km
نویسندگان
چکیده
We study the mixed Ramsey number maxR(n,Km,Kr), defined as the maximum number of colours in an edge-colouring of the complete graph Kn, such that Kn has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,Km,K4) ≤ n3/2 √ 2m for all m ≥ 3. Further, we discuss a possible way to improve their lower bound on maxR(n,K4,K4) based on incidence graphs of finite projective planes.
منابع مشابه
Fe b 20 09 A note on edge - colourings avoiding rainbow K 4 and monochromatic
We study the mixed Ramsey number maxR(n,Km,Kr), defined as the maximum number of colours in an edge-colouring of the complete graph Kn, such that Kn has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,Km,K4) ≤ n3/2 √ 2m for all m ≥ 3. Further, we discuss a possible way to impr...
متن کاملNon-monochromatic non-rainbow colourings of σ-hypergraphs
One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin’s notion of colourings of mixed hypergraphs. In this paper we shall study a specific instance of Voloshin’s idea: a non-monochromatic non-rainbow (NMNR) colouring of a hypergraph is a colouring of its vertices such that every edge has at least two vertices coloured with different colo...
متن کاملEdge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H , let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic to H . These two numbers generalize the classical anti-Ramsey and Ramsey numbers, respectively. ...
متن کاملEdge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
Let k and ` be positive integers. With a graph G, we associate the quantity ck,`(G), the number of k-colorings of the edge set of G with no monochromatic matching of size `. Consider the function ck,` : N −→ N given by ck,`(n) = max {ck,`(G) : |V (G)| = n}, the maximum of ck,`(G) over all graphs G on n vertices. In this paper, we determine ck,`(n) and the corresponding extremal graphs for all l...
متن کاملRamsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2 ck contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009